Scalable computational geometry in MapReduce
نویسندگان
چکیده
منابع مشابه
Scalable Subgraph Enumeration in MapReduce
Subgraph enumeration, which aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph, is a fundamental graph problem with a wide range of applications. However, existing sequential algorithms for subgraph enumeration fall short in handling large graphs due to the involvement of computationally intensive subgraph isomorphism operations. Thus, some recent ...
متن کاملScalable Graph Processing : Beyond MapReduce
My research interests are in the areas of (graph) databases, data analytics and data quality. My research is driven by a strong desire to make big, complex linked data easy to access and understand, for users at various knowledge levels. No data is an island. The rising of big graph data, such as biological networks, social graphs, knowledge graphs, Web graphs, cyber networks and physical netwo...
متن کاملScalable Distributed Reasoning Using MapReduce
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach on top of Hadoop and deployed it on a compute cluster of up to 64 commodity machines. We show that a naive implementation on top of MapReduce is straightforward but performs badly and we present several non-trivial opt...
متن کاملScalable parallel computational geometry for coarse grained multicomputers
We study scalable parallel computational geometry algorithms for the coarse grained multicomputermodel: p processors solving a problem on n data items, were each processor has O( p ) O(1) local memory and all processors are connected via some arbitrary interconnection network (e.g. mesh, hypercube, fat tree). We present O(sequential p + Ts(n; p)) time scalable parallel algorithms for several co...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2019
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-018-0534-5